0.00/0.01	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.02	% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.02/0.31	% Computer : n024.cluster.edu
0.02/0.31	% Model    : x86_64 x86_64
0.02/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.02/0.31	% Memory   : 8046.5625MB
0.02/0.31	% OS       : Linux 6.8.0-71-generic
0.02/0.31	% CPULimit : 1440
0.02/0.31	% WCLimit  : 180
0.02/0.31	% DateTime : Mon Jul 27 04:55:15 UTC 2026
0.02/0.31	% CPUTime  : 
0.02/0.31	Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.06/0.33	Running higher-order theorem proving
0.06/0.34	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.vbkXHBGzQt/E---3.1_2867166.p
0.06/0.35	% Version: 3.5.1-ho
0.06/0.35	% Preprocessing class: HSSSSMSSSSSNSSA.
0.06/0.35	% Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
0.06/0.35	% Starting post_as_ho12 with 180s (1) cores
0.06/0.35	% Starting new_bool_9 with 180s (1) cores
0.06/0.35	% Starting post_as_ho1 with 180s (1) cores
0.06/0.35	% Starting post_as_ho4 with 180s (1) cores
0.06/0.35	% Starting post_as_ho2 with 180s (1) cores
0.06/0.35	% Starting ehoh_best2_full_lfho with 180s (1) cores
0.06/0.35	% Starting full_lambda_10 with 180s (1) cores
0.06/0.35	% Starting new_ho_8 with 180s (1) cores
0.06/0.35	% post_as_ho12 with pid 2867179 completed with status 0
0.06/0.35	% Result found by post_as_ho12
0.06/0.35	% Preprocessing class: HSSSSMSSSSSNSSA.
0.06/0.35	% Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
0.06/0.35	% Starting post_as_ho12 with 180s (1) cores
0.06/0.35	% (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.06/0.35	% No SInE strategy applied
0.06/0.35	% Search class: HGUSF-FFSF21-SSSFFMBC
0.06/0.35	% Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.06/0.35	% Starting SubtermCWHack with 19s (1) cores
0.06/0.35	% SubtermCWHack with pid 2867188 completed with status 10
0.06/0.35	% Starting ho_unfolding_6 with 45s (1) cores
0.06/0.35	% ho_unfolding_6 with pid 2867194 completed with status 0
0.06/0.35	% Result found by ho_unfolding_6
0.06/0.35	% Preprocessing class: HSSSSMSSSSSNSSA.
0.06/0.35	% Scheduled 8 strats onto 8 cores with 180 seconds (1440 total)
0.06/0.35	% Starting post_as_ho12 with 180s (1) cores
0.06/0.35	% (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.06/0.35	% No SInE strategy applied
0.06/0.35	% Search class: HGUSF-FFSF21-SSSFFMBC
0.06/0.35	% Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.06/0.35	% Starting SubtermCWHack with 19s (1) cores
0.06/0.35	% SubtermCWHack with pid 2867188 completed with status 10
0.06/0.35	% Starting ho_unfolding_6 with 45s (1) cores
0.06/0.35	% Preprocessing time       : 0.001 s
0.06/0.35	
0.06/0.35	% Proof found!
0.06/0.35	% SZS status Theorem
0.06/0.35	% SZS output start CNFRefutation
0.06/0.35	thf(decl_sort1, type, a: $tType).
0.06/0.35	thf(decl_23, type, cR: a > a > $o).
0.06/0.35	thf(decl_24, type, esk1_1: (a > $o) > a).
0.06/0.35	thf(decl_25, type, esk2_2: (a > $o) > a > a).
0.06/0.35	thf(decl_26, type, esk3_0: a).
0.06/0.35	thf(cTHM542_pme, conjecture, (![X1:a]:((cR @ X1 @ X1))<=![X2:a > $o]:((?[X3:a]:((X2 @ X3))=>?[X3:a]:((((X2 @ X3)&![X4:a]:(((![X1:a]:(((X2 @ X1)=>(cR @ X4 @ X1)))&(X2 @ X4))=>((X4)=(X3)))))&![X1:a]:(((X2 @ X1)=>(cR @ X3 @ X1)))))))), file('/export/starexec/sandbox/tmp/tmp.vbkXHBGzQt/E---3.1_2867166.p', cTHM542_pme)).
0.06/0.35	thf(c_0_1, negated_conjecture, ~((![X1:a]:((cR @ X1 @ X1))<=![X2:a > $o]:((?[X3:a]:((X2 @ X3))=>?[X3:a]:((((X2 @ X3)&![X4:a]:(((![X1:a]:(((X2 @ X1)=>(cR @ X4 @ X1)))&(X2 @ X4))=>((X4)=(X3)))))&![X1:a]:(((X2 @ X1)=>(cR @ X3 @ X1))))))))), inference(assume_negation,[status(cth)],[cTHM542_pme])).
0.06/0.35	thf(c_0_2, negated_conjecture, ~((![X2:a > $o]:((?[X3:a]:((X2 @ X3))=>?[X3:a]:((((X2 @ X3)&![X4:a]:(((![X1:a]:(((X2 @ X1)=>(cR @ X4 @ X1)))&(X2 @ X4))=>((X4)=(X3)))))&![X1:a]:(((X2 @ X1)=>(cR @ X3 @ X1)))))))=>![X1:a]:((cR @ X1 @ X1)))), inference(fof_simplification,[status(thm)],[c_0_1])).
0.06/0.35	thf(c_0_3, negated_conjecture, ![X12:a > $o, X13:a, X15:a, X17:a]:((((((X12 @ (esk1_1 @ X12))|~(X12 @ X13))&(((X12 @ (esk2_2 @ X12 @ X15))|~(X12 @ X15)|((X15)=(esk1_1 @ X12))|~(X12 @ X13))&(~(cR @ X15 @ (esk2_2 @ X12 @ X15))|~(X12 @ X15)|((X15)=(esk1_1 @ X12))|~(X12 @ X13))))&(~(X12 @ X17)|(cR @ (esk1_1 @ X12) @ X17)|~(X12 @ X13)))&~(cR @ esk3_0 @ esk3_0))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])).
0.06/0.35	thf(c_0_4, negated_conjecture, ![X2:a > $o, X1:a]:(((X2 @ (esk1_1 @ X2))|~((X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_3])).
0.06/0.35	thf(c_0_5, negated_conjecture, ![X1:a, X2:a > $o, X3:a]:(((cR @ (esk1_1 @ X2) @ X1)|~((X2 @ X1))|~((X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
0.06/0.35	thf(c_0_6, negated_conjecture, ![X1:a]:(((esk1_1 @ (^[Z0:a]:(((Z0)=(X1)))))=(X1))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_4])).
0.06/0.35	thf(c_0_7, negated_conjecture, ~((cR @ esk3_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_3])).
0.06/0.35	thf(c_0_8, negated_conjecture, ![X1:a]:((cR @ X1 @ X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6])])])])).
0.06/0.35	thf(c_0_9, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])]), ['proof']).
0.06/0.35	% SZS output end CNFRefutation
0.06/0.35	% Parsed axioms                        : 3
0.06/0.35	% Removed by relevancy pruning/SinE    : 0
0.06/0.35	% Initial clauses                      : 7
0.06/0.35	% Removed in clause preprocessing      : 2
0.06/0.35	% Initial clauses in saturation        : 5
0.06/0.35	% Processed clauses                    : 8
0.06/0.35	% ...of these trivial                  : 0
0.06/0.35	% ...subsumed                          : 1
0.06/0.35	% ...remaining for further processing  : 7
0.06/0.35	% Other redundant clauses eliminated   : 4
0.06/0.35	% Clauses deleted for lack of memory   : 0
0.06/0.35	% Backward-subsumed                    : 0
0.06/0.35	% Backward-rewritten                   : 1
0.06/0.35	% Generated clauses                    : 20
0.06/0.35	% ...of the previous two non-redundant : 11
0.06/0.35	% ...aggressively subsumed             : 0
0.06/0.35	% Contextual simplify-reflections      : 0
0.06/0.35	% Paramodulations                      : 13
0.06/0.35	% Factorizations                       : 0
0.06/0.35	% NegExts                              : 0
0.06/0.35	% Equation resolutions                 : 4
0.06/0.35	% Disequality decompositions           : 0
0.06/0.35	% Total rewrite steps                  : 1
0.06/0.35	% ...of those cached                   : 0
0.06/0.35	% Propositional unsat checks           : 0
0.06/0.35	%    Propositional check models        : 0
0.06/0.35	%    Propositional check unsatisfiable : 0
0.06/0.35	%    Propositional clauses             : 0
0.06/0.35	%    Propositional clauses after purity: 0
0.06/0.35	%    Propositional unsat core size     : 0
0.06/0.35	%    Propositional preprocessing time  : 0.000
0.06/0.35	%    Propositional encoding time       : 0.000
0.06/0.35	%    Propositional solver time         : 0.000
0.06/0.35	%    Success case prop preproc time    : 0.000
0.06/0.35	%    Success case prop encoding time   : 0.000
0.06/0.35	%    Success case prop solver time     : 0.000
0.06/0.35	% Current number of processed clauses  : 6
0.06/0.35	%    Positive orientable unit clauses  : 1
0.06/0.35	%    Positive unorientable unit clauses: 1
0.06/0.35	%    Negative unit clauses             : 0
0.06/0.35	%    Non-unit-clauses                  : 4
0.06/0.35	% Current number of unprocessed clauses: 8
0.06/0.35	% ...number of literals in the above   : 24
0.06/0.35	% Current number of archived formulas  : 0
0.06/0.35	% Current number of archived clauses   : 1
0.06/0.35	% Clause-clause subsumption calls (NU) : 11
0.06/0.35	% Rec. Clause-clause subsumption calls : 8
0.06/0.35	% Non-unit clause-clause subsumptions  : 0
0.06/0.35	% Unit Clause-clause subsumption calls : 1
0.06/0.35	% Rewrite failures with RHS unbound    : 0
0.06/0.35	% BW rewrite match attempts            : 14
0.06/0.35	% BW rewrite match successes           : 4
0.06/0.35	% Condensation attempts                : 8
0.06/0.35	% Condensation successes               : 0
0.06/0.35	% Termbank termtop insertions          : 1181
0.06/0.35	% Search garbage collected termcells   : 238
0.06/0.35	
0.06/0.35	% -------------------------------------------------
0.06/0.35	% User time                : 0.003 s
0.06/0.35	% System time              : 0.002 s
0.06/0.35	% Total time               : 0.005 s
0.06/0.35	% Maximum resident set size: 3632 pages
0.06/0.35	
0.06/0.35	% -------------------------------------------------
0.06/0.35	% User time                : 0.004 s
0.06/0.35	% System time              : 0.005 s
0.06/0.35	% Total time               : 0.008 s
0.06/0.35	% Maximum resident set size: 4864 pages
0.06/0.35	% E exiting
0.06/0.35	EOF